The Dynamic-Q optimization method: An alternative to SQP?
نویسندگان
چکیده
منابع مشابه
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that can ensure global convergence. Inexact SQP methods are needed for large-scale applications for which the iteration matrix cannot be explicitly formed or factored and the arising linear systems must be solved using itera...
متن کاملAdaptive SQP Method for Shape Optimization
We examine shape optimization problems in the context of inexact sequential quadratic programming. Inexactness is a consequence of using adaptive finite element methods (AFEM) to approximate the state equation, update the boundary, and compute the geometric functional. We present a novel algorithm that uses a dynamic tolerance and equidistributes the errors due to shape optimization and discret...
متن کاملAN OPTIMIZATION METHOD TO DETERMINE THE LEAST COMMON MULTIPLY
This paper proposes an Integer Programming model to obtain the Least Common Multiply (LCM) for some integer numbers. The proposed method is illustrated by a numerical example.
متن کاملAn NE / SQP Method for the Bounded
NE/SQP is a recent algorithm that has proven quite eeective for solving the pure and mixed forms of the nonlinear complementarity problem (NCP). NE/SQP is robust in the sense that its direction-nding subproblems are always solvable; in addition, the convergence rate of this method is Q-quadratic. In this paper we consider a generalized version of NE/SQP proposed by Pang and Qi, that is suitable...
متن کاملA Method for Constrained Multiobjective Optimization Based on SQP Techniques
We propose a method for constrained and unconstrained nonlinear multiobjective optimization problems that is based on an SQP-type approach. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving single-objective constrained optimization problems. These single-objective problems are derived as SQP problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2002
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(02)00281-x